Default Negation as Explicit Negation plus Update

نویسندگان

چکیده

We argue that under the stable model semantics default negation can be read as explicit with update. show dynamic logic programming which is based on negation, even in heads, interpreted a variant of updates only. As corollaries, we get an easy description generalized and normal where initially negated literals are updated. These results discussed respect to understanding logic.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Negation by Default

In this paper, we propose a new semantic framework for disjunctive logic programs by introducing the so called static expansions which extend to disjunctive programs the notions of stable, well-founded and stationary (or partial stable) models while at the same time generalizing the minimal model semantics of positive disjunctive programs. For every disjunctive program P; we de ne rst order ext...

متن کامل

Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...

متن کامل

Semantics for Disjunctive Logic Programs with Explicit and Default Negation

The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, xpoin...

متن کامل

Explicit Negation in Relational

Negative facts in relational databases have traditionally been inferred using the closed world assumption. There are situations where this is not appropriate. We need to resort to the open world assumption, where the negative facts are sometimes explicitly stated. We present a formalism which is capable of answering queries in the relational database context under the open world assumption. We ...

متن کامل

Combining Explicit Negation and Negation by Failure Via Belnap's Logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two diierent forms of reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logi?eskie issledovaniâ

سال: 2021

ISSN: ['2413-2713', '2074-1472']

DOI: https://doi.org/10.21146/2074-1472-2021-27-1-64-81